public class Test {
    //先生成一个二叉树
    public static void main(String[] args) {

        Binarytree t = new Binarytree();
        Binarytree.TreeNode treenode = t.createTree();
        //t.preOrder(treenode);
        //t.inOrder(treenode);
        //System.out.println(t.getLeafNodeCount1(treenode));
       // t.getLeafNodeCount(treenode);
        //System.out.println(t.count);
       //System.out.println(t.getKLevelNodeCount(treenode, 3));
        //System.out.println(t.getHeight(treenode));
        Binarytree.TreeNode node=t.find(treenode,'D');
        System.out.println(node.val);
    }
}
